Co-Evolutionary Particle Swarm Optimization Applied to the 7x7 Seega Game

نویسندگان

  • Ashraf M. Abdelbar
  • Sherif Ragab
  • Sara Mitri
چکیده

Seega is an ancient Egyptian two-stage board game that, in certain aspects, is more difficult than chess. The twoplayer game is most commonly played on a 7 × 7 board, but is also sometimes played on a 5 × 5 or 9 × 9 board. In the first and more difficult stage of the game, players take turns placing one disk each on the board until the board contains only one empty cell. In the second stage players take turns moving disks of their color; a disk that becomes surrounded by disks of the opposite color is captured and removed from the board. Building on previous work, on the 5 × 5 version of Seega [1], we focus, in this paper, on the 7 × 7 board. Our approach employs co-evolutionary particle swarm optimization for the generation of feature evaluation scores. Two separate swarms are used to evolve White players and Black players, respectively; each particle represents feature weights for use in the position evaluation. Experimental results are presented and the performance of the full game engine are discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Applying Co-Evolutionary Particle Swarm Optimization to the Egyptian Board Game Seega

Seega is an ancient Egyptian two-phase board game that, in certain aspects, is more difficult than chess. The two-player game is played on either a 5 × 5, 7 × 7, or 9 × 9 board. In the first and more difficult phase of the game, players take turns placing one disk each on the board until the board contains only one empty cell. In the second phase players take turns moving disks of their color; ...

متن کامل

Particle Swarm Optimization for Hydraulic Analysis of Water Distribution Systems

The analysis of flow in water-distribution networks with several pumps by the Content Model may be turned into a non-convex optimization uncertain problem with multiple solutions. Newton-based methods such as GGA are not able to capture a global optimum in these situations. On the other hand, evolutionary methods designed to use the population of individuals may find a global solution even for ...

متن کامل

A Particle Swarm Optimization Based on Evolutionary Game Theory for Discrete Combinatorial Optimization

This paper presented a new particle swarm optimization based on evolutionary game theory (EPSO) for the traveling salesman problem (TSP) to overcome the disadvantages of premature convergence and stagnation phenomenon of traditional particle swarm optimization algorithm (PSO). In addition ,we make a mapping among the three parts discrete particle swarm optimization (DPSO)、 evolutionary game the...

متن کامل

PSO Algorithm for IPD Game

Mechanisms promoting the evolution of cooperation in two-player, two-strategy evolutionary games have been discussed in great detail over the past decades. Understanding the effects of repeated interactions in multi-player with multi-choice is a formidable challenge. This paper presents and investigates the application of co-evolutionary training techniques based on particle swarm optimization ...

متن کامل

A Bargaining Game Design Using Co-Evolution Analysis between Artificial Agents

In this paper, we present the interaction and co-evolutionary process between genetic algorithm-based agent (GA-based agent) and particle swarm optimization-based agent (PSO-based agent) in the bargaining game. Experimental results show that a PSO-based agent evolves a greedy agent even though the deal can't be accomplished but a GA-based one evolves a passive agent to accomplish a deal. Becaus...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004